Stochastic Analog Networks and Computational Complexity
نویسندگان
چکیده
منابع مشابه
Stochastic Analog Networks and Computational Complexity
The model of analog recurrent neural networks (ARNN) is typically perceived as based on either the practical powerful tool of automatic learning or on biological metaphors, yet it constitutes an appealing model of computation. This paper provides rigorous foundations for ARNN, when they are allowed to exhibit stochastic and random behavior of discrete nature. Our model is an extension of the vo...
متن کاملNeural Networks with Real Weights : Analog Computational Complexity
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time, corresponding to an unchanging number of \neurons". If allowed exponential time for computation, they turn out to have unbounded power. However, under polynomial-time constraints there are limits on their capabilitie...
متن کاملComputational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of literature on the subject has appeared. The researchers in the field have never ceased to emphasize the inherent difficulties in solving stochastic programming problems, without ever giving a theoretical justification of thi...
متن کاملThe Computational Complexity of Stochastic Optimization
This paper presents an investigation on the computational complexity of stochastic optimization problems. We discuss a scenariobased model which captures the important classes of two-stage stochastic combinatorial optimization, two-stage stochastic linear programming, and two-stage stochastic integer linear programming. This model can also be used to handle chance constraints, which are used in...
متن کاملComputational Complexity of Neural Networks
We survey some of the central results in the complexity theory of discrete neural networks, with pointers to the literature. Our main emphasis is on the computational power of various acyclic and cyclic network models, but we also discuss brieey the complexity aspects of synthesizing networks from examples of their behavior.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1999
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0505